A Survey on the Randić Index

نویسندگان

  • Xueliang Li
  • Yongtang Shi
چکیده

The general Randić index Rα(G) of a (chemical) graph G, is defined as the sum of the weights (d(u)d(v))α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α an arbitrary real number, which is called the Randić index or connectivity index (or branching index) for α = −1/2 proposed by Milan Randić in 1975. The paper outlines the results known for the (general) Randić index of (chemical) graphs. Some very new results are released. We classify the results into the following categories: extremal values and extremal graphs of Randić index, general Randić index, zeroth-order general Randić index, higher-order Randić index. A few conjectures and open problems are mentioned.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Modified Randić Index of Trees, Unicyclic Graphs and Bicyclic Graphs

The modified Randić index of a graph G is a graph invariant closely related to the classical Randić index, defined as

متن کامل

About a conjecture on the Randić index of graphs

For an edge uv of a graph G, the weight of the edge e = uv is denoted by w(e) = 1/ √ d(u)d(v). Then

متن کامل

A Note on the ZerothOrder General Randić Index of Cacti and Polyomino Chains

The present note is devoted to establish some extremal results for the zerothorder general Randić index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.

متن کامل

On the Randić index and Diameter of Chemical Graphs

Using the AutoGraphiX 2 system, Aouchiche, Hansen and Zheng [2] proposed a conjecture that the difference and the ratio of the Randić index and the diameter of a graph are minimum for paths. We prove this conjecture for chemical graphs.

متن کامل

On the Randić Index of Polyomino Chains

The Randić index R(G) of an organic molecule whose molecular graph is G is the sum of the weights (dudv)− 1 2 of all edges uv of G, where du(or dv) denote the degree of vertex u(or v). Efficient formulas for calculating the Randić index of polyomino chains are provided. Mathematics Subject Classification: 05C50, 05C12, 05C05

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007